Robust Recursive State Estimation With Random Measurement Droppings
نویسندگان
چکیده
منابع مشابه
Robust state estimation in power systems using pre-filtering measurement data
State estimation is the foundation of any control and decision making in power networks. The first requirement for a secure network is a precise and safe state estimator in order to make decisions based on accurate knowledge of the network status. This paper introduces a new estimator which is able to detect bad data with few calculations without need for repetitions and estimation residual cal...
متن کاملrobust state estimation in power systems using pre-filtering measurement data
state estimation is the foundation of any control and decision making in power networks. the first requirement for a secure network is a precise and safe state estimator in order to make decisions based on accurate knowledge of the network status. this paper introduces a new estimator which is able to detect bad data with few calculations without need for repetitions and estimation residual cal...
متن کاملRecursive Robust Estimation of Dynamic Systems Parameters
In the previolls pa.per (Pupeikis, 1990) the problem of model order determination in the presence of outliers in observations has been considered. The aim of t.he given paper is the development of the recursive algorithms of comput.ation of l\1estimates ensuring their stability conditions. In this conneciion the approa.ch, based on adaptive Huber's monot.one psi-function. is worked out. It. is ...
متن کاملRecursive robust estimation and control without commitment
In a Markov decision problem with hidden state variables, a posterior distribution serves as a state variable and Bayes’ law under an approximating model gives its law of motion. A decision maker expresses fear that his model is misspecified by surrounding it with a set of alternatives that are nearby when measured by their expected log likelihood ratios (entropies). Martingales represent alter...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2016
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2015.2437524